Reducing Communication Costs for Sparse Matrix Multiplication within Algebraic Multigrid

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing Communication Costs Associated with Parallel Algebraic Multigrid

Algebraic multigrid (AMG) is an iterative method for solving sparse linear systems of equations (Ax̂ = b), such as discretized partial differential equations arising in various fields of science and engineering. AMG is considered an optimal solver, requiring only O(n) operations to solve a system of n unknowns. Standard computers contain neither the memory nor computing power to solve increasing...

متن کامل

Reducing Inter-Process Communication Overhead in Parallel Sparse Matrix-Matrix Multiplication

Parallel sparse matrix-matrix multiplication algorithms (PSpGEMM) spend most of their running time on interprocess communication. In the case of distributed matrix-matrix multiplications, much of this time is spent on interchanging the partial results that are needed to calculate the final product matrix. This overhead can be reduced with a one dimensional distributed algorithm for parallel spa...

متن کامل

Reducing communication in algebraic multigrid using additive variants

Algebraic multigrid (AMG) has proven to be an effective scalable solver on many high performance computers, however its increasing communication complexity on coarser levels has shown to seriously impact its performance on computers with high communication cost. Additive AMG variants provide increased parallelism as well as decreased numbers of messages per cycle, but can also lead to decreased...

متن کامل

Reducing Parallel Communication in Algebraic Multigrid through Sparsification

Algebraic multigrid (AMG) is an O(n) solution process for many large sparse linear systems. A hierarchy of progressively coarser grids is constructed that utilize complementary relaxation and interpolation operators. High-energy error is reduced by relaxation, while low-energy error is mapped to coarse-grids and reduced there. However, large parallel communication costs often limit parallel sca...

متن کامل

Algebraic adjoint of the polynomials-polynomial matrix multiplication

This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2016

ISSN: 1064-8275,1095-7197

DOI: 10.1137/15m1028807